public class Solution {
    public int Fibonacci(int n) {

        int[]dp=new int[n+1];

        dp[0]=0;
        dp[1]=1;
        int i=2;

        for( ;i<=n;i++){
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
}
